ABSTRACT
With the continuous development of the COVID-19 pandemic, the selection of locations for medical isolation areas has not always been optimal for the timely transportation of infected people, or those suspected of being infected. This has resulted in failure to control the rate of spread of infection cases in time. To address this problem, this paper proposes a co-evolutionary location-routing optimization (CELRO) model of medical isolation areas for use in major public health emergencies to develop a rapid location-routing scheme for epidemic isolation, including the selection of locations of medical isolation facilities per area and the optimal route per vehicle to each infected person. Specifically, this paper solves the following two sub-problems: (i) calculate the shortest transportation times and corresponding routes from any medical isolation area to any person infected or suspected of being infected, and (ii) calculate the location scheme for distribution of isolation areas. Different from previous studies, the vehicle operating characteristics and the interference of uncertainty of the traffic environment are considered in the proposed model. To find an appropriate scheme for location of medical isolation areas with the shortest travel times, a co-evolutionary clustering algorithm (CECA), which is a combination of some separated evolutionary programming operations, is proposed to solve the model. Various network sizes and uncertainty combinations are used to design some comparative tests, which aim to verify the effectiveness of the proposed model. In the experiment section, CELRO reduced travel time by at least 14% compared with other methods. This finding can provide an effective theoretical basis for optimizing the spatial layout of medical isolation areas or the location planning of new medical facilities. © National Academy of Sciences.
ABSTRACT
The outbreak of the COVID-19 pandemic in recent years has raised serious concerns about the distribution of fast-moving consumer goods products, given the freshness of their use. On the one hand, the distribution of fast-moving consumer goods with multiple vehicles has led to maintaining the freshness of items at the supply chain level, and on the other hand, it involves the high costs of using vehicles. Congestion of vehicles and drivers in the distribution of items has also increased the possibility of COVID-19 transmission. The importance of the above issue has led to the modeling of a multi-level supply chain problem in the FMCG industry by considering the freshness of items to reduce COVID-19 transmission. The most important issue considered in this article is to send fresh food in the shortest possible time to customers who cannot go to stores and wait in line to buy items in the conditions of Covid-19. Therefore, the designed model provides the possibility for customers to receive fresh food in addition to reducing costs and also reduce the possibility of contracting Covid-19. Designed supply chain network levels include suppliers of raw materials, manufacturers of consumer goods, distributors and end customers. In order to optimize the objectives of the problem, including minimizing the total costs of supply chain network design and maximizing the freshness of items, various strategic and tactical decisions such as locating potential facilities, routing vehicles, and optimally allocating the flow of goods should be made. Since the supply chain network model is considered to be NP-hard, meta-heuristic algorithms have been used to solve the problem by providing a modified priority-based encoding. The results show the high efficiency of the proposed solution method in a short time.
ABSTRACT
The COVID-19 pandemic has presented tremendous challenges to the world, one of which is the management of infectious waste generated by healthcare activities. Finding cost-efficient services with minimum threats to public health has become a top priority. The pandemic has induced extreme uncertainties, not only in the amount of generated waste, but also in the associated service times. With this in mind, the present study develops a mixed-integer linear programming (MILP) model for the location-routing problem with time windows (LRPTW). To handle the uncertainty in the amount of generated waste, three scenarios are defined respectively reflecting different severity levels of a pandemic. Furthermore, chance constraints are applied to deal with the variation of the service times at small generation nodes, and time windows at the transfer facilities. The complexity of the resulting mathematical model motivated the application of a branch-and-price (B&P) algorithm along with an É -constraint technique. A case study of the situation of Wuhan, China, during the initial COVID-19 outbreak is employed to examine the performance and applicability of the proposed model. Our numerical tests indicate that the B&P algorithm outperforms CPLEX in the computational times by more than 83% in small-sized problem instances and reduces the gaps by at least 70% in large-scale ones. Through a comparison with the current and deterministic systems, our proposed stochastic system can timely adjust itself to fulfill nearly four times the demand of other systems in an extreme pandemic scenario, while maintaining a cost-efficient operation with no outbreak.
ABSTRACT
Vaccination studies against the Covid-19 virus, which has affected our country and the whole world, bring along a major logistical problem for the mass vaccination of the modern world. Various vaccines produced by different methods such as mRNA and inactive virus method are made ready for mass production by companies. A well-planned distribution network is important for these vaccines with different shelf life under different conditions. In this study, the two-echelon location-routing model that will efficiently use the shelf life for Covid-19 mRNA vaccines, which are used in our country and need harsh storage conditions, is emphasized. In this respect, hubs and centers were determined with two different methods, and then time-limited capacitated vehicle routing problem mathematical model was developed for vehicle routes between the determined locations. As a result, two-stage deployment-routing model made it possible to successfully identify the appropriate delivery model forvaccines to be consumed before the shelf-life period. Scientists in the field of medicine state that such epidemics will be encountered again in the coming years. Therefore, the study will be developed further in the following years and will ensure that the vaccine distribution policy in the country is ready and effective in advance.
ABSTRACT
Industrialization and population growth have been accompanied by many problems such as waste management worldwide. Waste management and reduction have a vital role in national management. The presents study represents a multi-objective location-routing problem for hazardous wastes. The model was solved using Non dominated Sorting Genetic Algorithm-II, Multi-Objective Particle Swarm Optimization, Multi-Objective Invasive Weed Optimization, Pareto Envelope-based Selection Algorithm, Multi-Objective Evolutionary Algorithm Based on Decomposition and Multi-Objective Grey Wolf Optimizer algorithms. The findings revealed that the Multi-Objective Invasive Weed Optimization algorithm was the best and the most efficient among the algorithms used in this study. Obtaining income from the incineration of the wastes and reducing the risk of COVID-19 infection are the first innovation of the present study, which considered in the presented model. The second innovation is that uncertainty was considered for some of the crucial parameters of the model while the robust fuzzy optimization model was applied. Besides, the model was solved using several meta-heuristic algorithms such as Multi-Objective Invasive Weed Optimization, Multi-Objective Evolutionary Algorithm Based on Decomposition and Multi-Objective Grey Wolf Optimizer, which were rarely used in literature. Eventually, the most efficient algorithm was identified by comparing the considered algorithms.
ABSTRACT
Disasters such as earthquakes, typhoons, floods and COVID-19 continue to threaten the lives of people in all countries. In order to cover the basic needs of the victims, emergency logistics should be implemented in time. Location-routing problem (LRP) tackles facility location problem and vehicle routing problem simultaneously to obtain the overall optimization. In response to the shortage of relief materials in the early post-disaster stage, a multi-objective model for the LRP considering fairness is constructed by eval-uating the urgency coefficients of all demand points. The objectives are the lowest cost, delivery time and degree of dissatisfaction. Since LRP is a NP-hard problem, a hybrid metaheuristic algorithm of Discrete Particle Swarm Opti-mization (DPSO) and Harris Hawks Optimization (HHO) is designed to solve the model. In addition, three improvement strategies, namely elite-opposition learning, nonlinear escaping energy, multi-probability random walk, are intro-duced to enhance its execution efficiency. Finally, the effectiveness and perfor-mance of the LRP model and the hybrid metaheuristic algorithm are verified by a case study of COVID-19 in Wuhan. It demonstrates that the hybrid meta-heuristic algorithm is more competitive with higher accuracy and the ability to jump out of the local optimum than other metaheuristic algorithms.
ABSTRACT
In the COVID-19 pandemic, it is essential to transport medical supplies to specific locations accurately, safely, and promptly on time. The application of drones for medical supplies delivery can break ground traffic restrictions, shorten delivery time, and achieve the goal of contactless delivery to reduce the likelihood of contacting COVID-19 patients. However, the existing optimization model for drone delivery is cannot meet the requirements of medical supplies delivery in public health emergencies. Therefore, this paper proposes a bi-objective mixed integer programming model for the multi-trip drone location routing problem, which allows simultaneous pick-up and delivery, and shorten the time to deliver medical supplies in the right place. Then, a modified NSGA-II (Non-dominated Sorting Genetic Algorithm II) which includes double-layer coding, is designed to solve the model. This paper also conducts multiple sets of data experiments to verify the performance of modified NSGA-II. Comparing with separate pickup and delivery modes, this study demonstrates that the proposed optimization model with simultaneous pickup and delivery mode achieves a shorter time, is safer, and saves more resources. Finally, the sensitivity analysis is conducted by changing some parameters, and providing some reference suggestions for medical supplies delivery management via drones.
ABSTRACT
In late 2019 a new coronavirus disease (COVID-19) emerged, causing a global pandemic within only a few weeks. A crucial factor in the public health response to pandemics is achieving a short turnaround time between a potential case becoming known, specimen collection and availability of a test result. In this article we address a logistics problem that arises in the context of testing potential cases. We assume that specimens can be collected in two ways: either by means of a mobile test-team or by means of a stationary test-team in a test-centre. After the specimens have been collected they must be delivered to a laboratory in order to be analysed. The problem we address aims at deciding how many test-centres to open and where, how many mobile test-teams to use, which suspected cases to assign to a test-centre and which to visit with a mobile test-team, which specimen to assign to which laboratory, and planning the routes of the mobile test-teams. The objective is to minimise the total cost of opening test-centres and routing mobile test-teams. We introduce this new problem, which we call the contagious disease testing problem (CDTP), and present a mixed-integer linear-programming formulation for it. We propose a large neighbourhood search metaheuristic for solving the CDTP and present an extensive computational study to illustrate its performance. Furthermore, we give managerial insights regarding COVID-19 test logistics, derived from problem instances based on real world data.
ABSTRACT
The current global COVID-19 pandemic attracts public attention to the management of waste generated by health-care activities. Due to the hazardous nature, infectious waste requires the design of a multi-tiered system to provide cost-efficient and eco-friendly services of waste collection, transportation, treatment, and final disposal. However, the impact of uncertainties has not been well studied in the existing literature. Considering the presence of random waste generation during a pandemic, we aim to answer the following questions: 1) where to locate temporary transfer stations and temporary treatment centers; 2) how to plan collection tours among the small generation nodes and temporary transfer stations; 3) how to plan the direct transportation from large generation nodes to treatment centers; 4) how to transport waste from temporary transfer stations to treatment centers, and 5) how to transport wastes from treatment centers to disposal facilities. The relevant cost and associated risk are respectively formulated and assessed using a scenario-based bi-objective robust approach. The complexity of the resulting mathematical model motivated the adaption and comparison of three multi-objective optimization approaches, including the goal programming method, a lexicographic weighted Tchebycheff approach, and an augmented ϵ-constraint solution technique. A case study based on the real situation in Wuhan, China, during the COVID-19 outbreak is conducted to demonstrate the workability of the proposed model and provide managerial insights for infectious waste management. The computational results show that our proposed model can more than double the demand fulfillment rate at an approximately 40% lower cost when facing a distinctively high increment in the amount of infectious waste.
ABSTRACT
The performance of waste management system has been recently interrupted and encountered a very serious situation due to the epidemic outbreak of the novel Coronavirus (COVID-19). To this end, the handling of infectious medical waste has been particularly more vital than ever. Therefore, in this study, a novel mixed-integer linear programming (MILP) model is developed to formulate the sustainable multi-trip location-routing problem with time windows (MTLRP-TW) for medical waste management in the COVID-19 pandemic. The objectives are to concurrently minimize the total traveling time, total violation from time windows/service priorities and total infection/environmental risk imposed on the population around disposal sites. Here, the time windows play a key role to define the priority of services for hospitals with a different range of risks. To deal with the uncertainty, a fuzzy chance-constrained programming approach is applied to the proposed model. A real case study is investigated in Sari city of Iran to test the performance and applicability of the proposed model. Accordingly, the optimal planning of vehicles is determined to be implemented by the municipality, which takes 19.733 h to complete the processes of collection, transportation and disposal. Finally, several sensitivity analyses are performed to examine the behavior of the objective functions against the changes of controllable parameters and evaluate optimal policies and suggest useful managerial insights under different conditions.
Subject(s)
COVID-19 , Medical Waste , Refuse Disposal , Waste Management , Cities , Disease Outbreaks , Humans , Iran , Pandemics , SARS-CoV-2ABSTRACT
This paper discusses an optimization model for handling the impact of the COVID-19 pandemic based on food supply network through regional food hubs (RFHs) under uncertainty. To this end, uncertainty is assumed in the demand and production data. During the Pandemic COVID-19 period, uncertainty has increased and the food supply chain system has changed. Thus, a new configuration of the food supply network requires analysis. In this paper, the concept of RFH is introduced to connect producers in rural areas and customers in urban areas. This paper determines the location and capacity of RFHs, the food supply network, the sum of maximum food supplies, and minimum logistics cost. This is done via a Multi-Objective Many-to-Many Location-Routing Problem model. Furthermore, since the conditions of the COVID-19 pandemic is uncertain, robust optimization is employed to handle uncertainties. During the current pandemic, red zones are defined to indicate the severity of the pandemic in a region. In this paper, the numerical experiment is considered for three scenarios: when a region is in large-scale social distancing, partial social distancing, or normal conditions. This social distancing situation is based on the defined red zones. The optimal food supply network is obtained for the three scenarios and the best scenario among the three is identified.